Theory of computation by Deeba Kannan

0:05:59

TOC Lec 00-Introduction to Theory of computation by Deeba Kannan

0:16:53

Theory of Computation – Introduction to Moore and Mealy Machines by Deeba Kannan

0:11:18

Theory of Computation – Context-Free Grammar for Context-Free Language by Deeba Kannan

0:27:37

Theory of Computation - Turing Machine Formal Representation by Deeba Kannan

0:05:59

Theory of Computation – MPCP to PCP by Deeba Kannan

0:03:12

Theory of Computation – Parsing Introduction by Deeba Kannan

0:10:56

Theory of Computation – Moore Machine Working and Representation with Example by Deeba Kannan

0:11:28

Theory of Computation – Mealy to Moore Machine Conversion by Deeba Kannan

0:09:13

Theory of Computation – Context-Free Grammar for Regular Expressions by Deeba Kannan

0:17:30

TOC Lec 17 - DFA to Regular expression by Deeba Kannan

0:19:28

TOC Lec 12-Regular Expression to DFA by Deeba kannan

0:11:06

TOC Lec 01-Introduction to finite automata(FA) by Deeba Kannan

0:14:04

Theory of Computation – Closure Properties of Context-Free Languages by Deeba Kannan

0:11:33

TOC Lec 07-NFA to DFA conversion using subset construction by Deeba Kannan

0:11:26

Theory of Computation – Example 2: Chomsky Normal Form by Deeba Kannan

0:11:15

Theory of Computation – Context-Free Grammar for Programming Language Syntax by Deeba Kannan

0:17:08

TOC Lec 37-Introduction to Turing machine by Deeba Kannan

0:04:32

TOC Lec 09 - Regular Expression to Epsilon NFA by Deeba Kannan

0:10:44

Theory of Computation – Closure Properties of Regular Languages by Deeba Kannan

0:10:51

Theory of Computation – Mealy Machine Working and Representation with Examples by Deeba Kannan

0:04:36

Theory of Computation – Moore to Mealy Machine Conversion by Deeba Kannan

0:04:34

TOC Example 1 - Scenario based question Finite Automata Construction

0:03:57

TOC Lec 38-Simple example for Turing machine by Deeba Kannan

0:03:32

TOC Lec 02-NFA and DFA by Deeba Kannan